Minimal Forbidden Words and Symbolic Dynamics Classiication: Automata and Formal Languages
نویسندگان
چکیده
We introduce a new complexity measure of a factorial formal language L: the growth rate of the set of minimal forbidden words. We prove some combinatorial properties of minimal forbidden words. As main result we prove that the growth rate of the set of minimal forbidden words for L is a topological invariant of the dynamical system deened by L.
منابع مشابه
Factorizable Language: From Dynamics to Biology
There is no universal measure of complexity. When the problem under study leads to description by means of symbolic sequences, formal language theory may provide a convenient framework for analysis. In this review we concentrate on a special class of languages, namely, factorizable languages to be defined later, which occur in many problems of dynamics and biology. In dynamics we have in mind s...
متن کاملForbidden Words in Symbolic Dynamics
We introduce an equivalence relation between functions from to . By describing a symbolic dynamical system in terms of forbidden words, we prove that the -equivalence class of the function that counts the minimal forbidden words of a system is a topological invariant of the system. We show that the new invariant is independent from previous ones, but it is not characteristic. In the case of sof...
متن کاملA modular architecture for transparent computation in recurrent neural networks
Computation is classically studied in terms of automata, formal languages and algorithms; yet, the relation between neural dynamics and symbolic representations and operations is still unclear in traditional eliminative connectionism. Therefore, we suggest a unique perspective on this central issue, to which we would like to refer as transparent connectionism, by proposing accounts of how symbo...
متن کاملComplexity of Evolution Languages of the Elementary Cellular Automaton of Rule 146
Symbolic dynamics of cellular automata is introduced by coarse-graining the temporal evolution orbits. Evolution languages are defined. By using the theory of formal languages and automata, the complexity of evolution languages of the elementary cellular automaton of rule 146 is studied and it is proved that its width 1-evolution language is regular, but for every n ≥ 2 its width n-evolution la...
متن کاملRecurrent Neural Networks Learn Deterministic Representations of Fuzzy Finite-State Automata
The paradigm of deterministic nite-state automata (DFAs) and their corresponding regular languages have been shown to be very useful for addressing fundamental issues in recurrent neural networks. The issues that have been addressed include knowledge representation, extraction, and reenement as well development of advanced learning algorithms. Recurrent neural networks are also very promising t...
متن کامل